婴儿对一般运动（GM）的评估是早期诊断神经发育障碍的有用工具。但是，其在临床实践中的评估依赖于专家的视觉检查，并且热切期待自动解决方案。最近，基于视频的GMS分类引起了人们的注意，但是这种方法将受到无关信息的强烈影响，例如视频中的背景混乱。此外，为了可靠性，有必要在GMS期间正确提取婴儿的时空特征。在这项研究中，我们提出了一种自动GMS分类方法，该方法由预处理网络组成，该网络从GMS视频中删除不必要的背景信息并调整婴儿的身体位置以及基于两流结构的后续运动分类网络。提出的方法可以有效地提取GMS分类的基本时空特征，同时防止过度拟合与不同记录环境无关的信息。我们使用从100名婴儿获得的视频验证了提出的方法。实验结果表明，所提出的方法的表现优于几个基线模型和现有方法。

在本文中，我们提出了一种基于Markov转变的规模混合分布的时间序列随机模型，以检测脑电图（EEG）中的癫痫发作。在所提出的模型中，假设在高斯分布之后的每个时间点处的EEG信号是随机变量。高斯分布的协方差矩阵用潜伏的参数加权，这也是随机变量，导致协方差的随机波动。通过在该随机关系的背景下与Markov链引入潜在的状态变量，可以根据癫痫发作的状态来表示潜在比例参数分布的时间序列变化。在实验中，我们评估了使用具有从临床数据集分解的多个频带的eEgs来评估所提出的癫痫发作检测模型。结果表明，所提出的模型可以检测具有高灵敏度和优于几个基线的癫痫发作。

In subcellular biological research, fluorescence staining is a key technique to reveal the locations and morphology of subcellular structures. However, fluorescence staining is slow, expensive, and harmful to cells. In this paper, we treat it as a deep learning task termed subcellular structure prediction (SSP), aiming to predict the 3D fluorescent images of multiple subcellular structures from a 3D transmitted-light image. Unfortunately, due to the limitations of current biotechnology, each image is partially labeled in SSP. Besides, naturally, the subcellular structures vary considerably in size, which causes the multi-scale issue in SSP. However, traditional solutions can not address SSP well since they organize network parameters inefficiently and inflexibly. To overcome these challenges, we propose Re-parameterizing Mixture-of-Diverse-Experts (RepMode), a network that dynamically organizes its parameters with task-aware priors to handle specified single-label prediction tasks of SSP. In RepMode, the Mixture-of-Diverse-Experts (MoDE) block is designed to learn the generalized parameters for all tasks, and gating re-parameterization (GatRep) is performed to generate the specialized parameters for each task, by which RepMode can maintain a compact practical topology exactly like a plain network, and meanwhile achieves a powerful theoretical topology. Comprehensive experiments show that RepMode outperforms existing methods on ten of twelve prediction tasks of SSP and achieves state-of-the-art overall performance.

Transparency of Machine Learning models used for decision support in various industries becomes essential for ensuring their ethical use. To that end, feature attribution methods such as SHAP (SHapley Additive exPlanations) are widely used to explain the predictions of black-box machine learning models to customers and developers. However, a parallel trend has been to train machine learning models in collaboration with other data holders without accessing their data. Such models, trained over horizontally or vertically partitioned data, present a challenge for explainable AI because the explaining party may have a biased view of background data or a partial view of the feature space. As a result, explanations obtained from different participants of distributed machine learning might not be consistent with one another, undermining trust in the product. This paper presents an Explainable Data Collaboration Framework based on a model-agnostic additive feature attribution algorithm (KernelSHAP) and Data Collaboration method of privacy-preserving distributed machine learning. In particular, we present three algorithms for different scenarios of explainability in Data Collaboration and verify their consistency with experiments on open-access datasets. Our results demonstrated a significant (by at least a factor of 1.75) decrease in feature attribution discrepancies among the users of distributed machine learning.

The success of deep learning is partly attributed to the availability of massive data downloaded freely from the Internet. However, it also means that users' private data may be collected by commercial organizations without consent and used to train their models. Therefore, it's important and necessary to develop a method or tool to prevent unauthorized data exploitation. In this paper, we propose ConfounderGAN, a generative adversarial network (GAN) that can make personal image data unlearnable to protect the data privacy of its owners. Specifically, the noise produced by the generator for each image has the confounder property. It can build spurious correlations between images and labels, so that the model cannot learn the correct mapping from images to labels in this noise-added dataset. Meanwhile, the discriminator is used to ensure that the generated noise is small and imperceptible, thereby remaining the normal utility of the encrypted image for humans. The experiments are conducted in six image classification datasets, consisting of three natural object datasets and three medical datasets. The results demonstrate that our method not only outperforms state-of-the-art methods in standard settings, but can also be applied to fast encryption scenarios. Moreover, we show a series of transferability and stability experiments to further illustrate the effectiveness and superiority of our method.

Offline multi-agent reinforcement learning (MARL) aims to learn effective multi-agent policies from pre-collected datasets, which is an important step toward the deployment of multi-agent systems in real-world applications. However, in practice, each individual behavior policy that generates multi-agent joint trajectories usually has a different level of how well it performs. e.g., an agent is a random policy while other agents are medium policies. In the cooperative game with global reward, one agent learned by existing offline MARL often inherits this random policy, jeopardizing the performance of the entire team. In this paper, we investigate offline MARL with explicit consideration on the diversity of agent-wise trajectories and propose a novel framework called Shared Individual Trajectories (SIT) to address this problem. Specifically, an attention-based reward decomposition network assigns the credit to each agent through a differentiable key-value memory mechanism in an offline manner. These decomposed credits are then used to reconstruct the joint offline datasets into prioritized experience replay with individual trajectories, thereafter agents can share their good trajectories and conservatively train their policies with a graph attention network (GAT) based critic. We evaluate our method in both discrete control (i.e., StarCraft II and multi-agent particle environment) and continuous control (i.e, multi-agent mujoco). The results indicate that our method achieves significantly better results in complex and mixed offline multi-agent datasets, especially when the difference of data quality between individual trajectories is large.

The role of mobile cameras increased dramatically over the past few years, leading to more and more research in automatic image quality enhancement and RAW photo processing. In this Mobile AI challenge, the target was to develop an efficient end-to-end AI-based image signal processing (ISP) pipeline replacing the standard mobile ISPs that can run on modern smartphone GPUs using TensorFlow Lite. The participants were provided with a large-scale Fujifilm UltraISP dataset consisting of thousands of paired photos captured with a normal mobile camera sensor and a professional 102MP medium-format FujiFilm GFX100 camera. The runtime of the resulting models was evaluated on the Snapdragon's 8 Gen 1 GPU that provides excellent acceleration results for the majority of common deep learning ops. The proposed solutions are compatible with all recent mobile GPUs, being able to process Full HD photos in less than 20-50 milliseconds while achieving high fidelity results. A detailed description of all models developed in this challenge is provided in this paper.

优化组合结构是许多现实世界中的核心，例如生命科学中遇到的问题。例如，抗体设计中涉及的关键步骤之一是在蛋白质序列中找到氨基酸的排列，以改善其与病原体的结合。由于极大的搜索空间和非线性目标，很难对抗体进行组合优化。即使对于适度的抗体设计问题，蛋白质的序列长度为11，我们也面临着超过2.05 x 10^14结构的搜索。应用传统的增强学习算法，例如Q-学习算法来组合优化，导致性能差。我们提出了结构化Q学习（SQL），这是Q学习的扩展，该Q学习结合了结构性先验，以进行组合优化。使用分子对接模拟器，我们证明了SQL可以找到高结合能序列，并在八个具有挑战性的抗体设计任务上对基准的表现良好，包括设计SARS-COV的抗体。

多源数据融合，共同分析了多个数据源以获得改进的信息，引起了广泛的研究关注。对于多个医疗机构的数据集，数据机密性和跨机构沟通至关重要。在这种情况下，数据协作（DC）分析通过共享维数减少的中间表示，而无需迭代跨机构通信可能是合适的。在分析包括个人信息在内的数据时，共享数据的可识别性至关重要。在这项研究中，研究了DC分析的可识别性。结果表明，共享的中间表示很容易识别为原始数据以进行监督学习。然后，这项研究提出了一个非可读性可识别的直流分析，仅共享多个医疗数据集（包括个人信息）的非可读数据。所提出的方法基于随机样本排列，可解释的直流分析的概念以及无法重建的功能的使用来解决可识别性问题。在医学数据集的数值实验中，提出的方法表现出非可读性可识别性，同时保持了常规DC分析的高识别性能。对于医院的数据集，提出的方法在仅使用本地数据集的本地分析的识别性能方面表现出了9个百分点的改善。

最近，已经开发了数据协作（DC）分析，以跨多个机构跨多个机构提供隐私的综合分析。 DC分析集中了单独构建的维度减少中间表示形式，并通过协作表示实现集成分析，而无需共享原始数据。为了构建协作表示形式，每个机构都会生成并共享一个可共享的锚数据集并集中其中间表示。尽管随机锚数据集对DC分析的功能很好，但使用其分布与RAW数据集的分布接近的锚数据集有望改善识别性能，尤其是对于可解释的DC分析。基于合成少数群体过度采样技术（SMOTE）的扩展，本研究提出了一种锚数据构建技术，以提高识别性能，而不会增加数据泄漏的风险。数值结果证明了所提出的基于SMOTE方法的效率比人工和现实世界数据集的现有锚数据构建体的效率。具体而言，所提出的方法在收入数据集的现有方法上分别实现了9个百分点和38个百分点的性能改进。提出的方法提供了SMOTE的另一种用途，而不是用于不平衡的数据分类，而是用于隐私保护集成分析的关键技术。